Improved self-reduction algorithms for graphs with bounded treewidth
نویسندگان
چکیده
منابع مشابه
Improved Steiner Tree Algorithms for Bounded Treewidth
We propose a new algorithm that solves the Steiner tree problem on graphs with vertex set V to optimality in O(B tw+2 · tw · |V |) time, where tw is the graph’s treewidth and the Bell number Bk is the number of partitions of a k-element set. This is a linear time algorithm for graphs with fixed treewidth and a polynomial algorithm for tw = O(log |V |/ log log |V |). While being faster than the ...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملReduction Algorithms for Graphs of Small Treewidth
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. Arnborg et al. [2] have shown that many decision problems on graphs can be solved in linear time on graphs of bounded treewidth, by using a finite set of reduction rules. These algorithms can be used to solve problems on graphs of bounded treewidth without the need to first obtain a ...
متن کاملOn Reduction Algorithms for Graphs with Small Treewidth
Some new ideas are presented on graph reduction applied to graphs with bounded treewidth. It is shown that the method can not only be applied to solve decision problems, but also some optimization problems and construction variants of several of these problems on graphs with some constant upper bound on the treewidth. Also, the exisitence is shown of nite, safe, complete, and terminating sets o...
متن کاملAlgorithms for graphs of bounded treewidth via orthogonal range searching
We show that, for any fixed constant k ≥ 3, the sum of the distances between all pairs of vertices of an abstract graphs with n vertices and treewidth at most k can be computed in O(n logk−1 n) time. We also show that, for any fixed constant k ≥ 2, the dilation of a geometric graph (i.e., a graph drawn in the plane with straight-line segments) with n vertices and treewidth at most k can be comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90018-3